|
In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936, is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that : where ''p''''n'' denotes the ''n''th prime number, ''O'' is big O notation, and "log" is the natural logarithm. While this is the statement explicitly conjectured by Cramér, his argument actually supports the stronger statement : and this formulation is often called Cramér's conjecture in the literature. Neither form of Cramér's conjecture has yet been proven or disproven. ==Conditional proven results on prime gaps== Cramér gave a conditional proof of the much weaker statement that : on the assumption of the Riemann hypothesis.〔 In the other direction, E. Westzynthius proved in 1931 that prime gaps grow more than logarithmically. That is,〔.〕 : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cramér's conjecture」の詳細全文を読む スポンサード リンク
|